Cover Geometry Design using Multiple Convex Hulls for Novices
نویسندگان
چکیده
منابع مشابه
Convex Hulls for Random Lines
Consider n i .i .d . random lines in the plane defined by their slope and distance from the origin . The slope is uniformly distributed on (0, 27r] and independent of the distance R from the origin . These lines define a set I of n(n 1)/2 intersection points . It was recently shown by Atallah and Ching and Lee that the cardinality of the convex hull of these intersection points is 0(n), and the...
متن کاملConstructing Strongly Convex Hulls Using Exact or
One useful generalization of the convex hull of a set S of n points is the-strongly convex-hull. It is deened to be a convex polygon P with vertices taken from S such that no point in S lies farther than outside P and such that even if the vertices of P are perturbed by as much as , P remains convex. It was an open question 1 as to whether an-strongly convex O()-hull existed for all positive. W...
متن کاملView Synthesis using Convex and Visual Hulls
This paper discusses two efficient methods for image based rendering. Both algorithms approximate the world object. One uses the convex hull and the other uses the visual hull. We show that the overhead of using the latter is not always justified and in some cases, might even hurt. We demonstrate the method on real images from a studio-like setting in which many cameras are used, after a simple...
متن کاملComputing Convex Hulls Using Smart Pixels
We consider a problem domain consisting of a quadratic grid of n “smart pixels” which observe a black-andwhite image. Each of these smart pixels can communicate with its direct neighbors and perform simple computations. Contiguous groups of black pixels form objects on the grid. We present a deterministic algorithm to compute the convex hulls of all objects on the pixel grid simultaneously in t...
متن کاملFormalizing Convex Hulls Algorithms
We study the development of formally proved algorithms for computational geometry. The result of this work is a formal description of the basic principles that make convex hull algorithms work and two programs that implement convex hull computation and have been automatically obtained from formally verified mathematical proofs. A special attention has been given to handling degenerated cases th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society for Precision Engineering
سال: 2011
ISSN: 0912-0289,1882-675X
DOI: 10.2493/jjspe.77.1033